Completion by perturbations
نویسندگان
چکیده
Any non-complete orthonormal system in a Hilbert space can be transformed into basis by small perturbations.
منابع مشابه
Colorization by Matrix Completion
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a novel approach to the colorization problem by formulating it as a matrix completion problem. In particular, taking a monochrome image and parts of the color pixels (labels) as inputs, we develop a robust colorization mo...
متن کاملSynthesis by Completion
The Knuth-Bendix completion procedure was introduced as a means of deriving canonical term-rewriting systems to serve as deci sion procedures for given equational theories. The procedure gen erates new rewrite rules to resolve ambiguities resulting from exist ing rules that overlap. We propose using this procedure to syn thesize logic programs, as well as functional programs, from specifica...
متن کاملScheduling by Positional Completion Times
We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one. This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for owshop problems, where the jobs only diier in their processing times. We illustrate the eeectiveness of this type of formulation for a two-machine owshop problem where the rst machine is a...
متن کاملEnhanced synchronizability by structural perturbations.
In this Brief Report, we investigate the collective synchronization of a system of coupled oscillators on a Barabási-Albert scale-free network. We propose an approach of structural perturbations aiming at those nodes with maximal betweenness. This method can markedly enhance the network synchronizability, and is easy to realize. The simulation results show that the eigenratio will sharply decre...
متن کاملGaussian sampling by local perturbations
We present a technique for exact simulation of Gaussian Markov random fields (GMRFs), which can be interpreted as locally injecting noise to each Gaussian factor independently, followed by computing the mean/mode of the perturbed GMRF. Coupled with standard iterative techniques for the solution of symmetric positive definite systems, this yields a very efficient sampling algorithm with essentia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis and Mathematical Physics
سال: 2022
ISSN: ['1664-2368', '1664-235X']
DOI: https://doi.org/10.1007/s13324-022-00653-1